Hardness of conjugacy and factorization of multidimensional subshifts of finite type
نویسندگان
چکیده
We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension d > 1. In particular, we prove that the factorization problem is Σ3-complete and the conjugacy problem Σ1-complete in the arithmetical hierarchy.
منابع مشابه
Hardness of conjugacy, embedding and factorization of multidimensional subshifts
Subshifts of finite type are sets of colorings of the plane defined by local constraints. They can be seen as a discretization of continuous dynamical systems. We investigate here the hardness of deciding factorization, conjugacy and embedding of subshifts in dimensions d > 1 for subshifts of finite type and sofic shifts and in dimensions d ≥ 1 for effective shifts. In particular, we prove that...
متن کاملHardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type
Subshifts of finite type are sets of colorings of the plane defined by local constraints. They can be seen as a discretization of continuous dynamical systems. We investigate here the hardness of deciding factorization, conjugacy and embedding of subshifts of finite type (SFTs) in dimension d > 1. In particular, we prove that the factorization problem is Σ3-complete and that the conjugacy and e...
متن کاملDynamique symbolique des systèmes 2D et des arbres infinis. (Symbolic dynamics on multidimensional systems and infinite trees)
This thesis is devoted to the study of subshifts, or symbolic dynamical systems, defined on some finitely presented monoids like Zd or the infinite binary tree. The main result concerning multidimensional subshifts establishes that any effective subshift of dimension d can be obtained by factor map and projective subaction of a subshift of finite type of dimension d+ 1. This result has many app...
متن کاملA Matrix Formalism for Conjugacies of Higher-dimensional Shifts of Finite Type
We develop a natural matrix formalism for state splittings and amalgamations of higher-dimensional subshifts of finite type which extends the common notion of strong shift equivalence of Z+-matrices. Using the decomposition theorem every topological conjugacy between two Zd-shifts of finite type can thus be factorized into a finite chain of matrix transformations acting on the transition matric...
متن کاملOn the type of conjugacy classes and the set of indices of maximal subgroups
Let $G$ be a finite group. By $MT(G)=(m_1,cdots,m_k)$ we denote the type of conjugacy classes of maximal subgroups of $G$, which implies that $G$ has exactly $k$ conjugacy classes of maximal subgroups and $m_1,ldots,m_k$ are the numbers of conjugates of maximal subgroups of $G$, where $m_1leqcdotsleq m_k$. In this paper, we give some new characterizations of finite groups by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1204.4988 شماره
صفحات -
تاریخ انتشار 2012